Parameter Learning Online Algorithm for Multiprocessor Scheduling with Rejection
نویسندگان
چکیده
منابع مشابه
Parameter Learning Online Algorithm for Multiprocessor Scheduling with Rejection
In multiprocessor scheduling with rejection the jobs are characterized by a processing time and a penalty and it is possible to reject the jobs. The goal is to minimize the makespan of the schedule for the accepted jobs plus the sum of the penalties of the rejected jobs. In this paper we present a new online algorithm for the problem. Our algorithm is a parameter learning extension of the total...
متن کاملPreemptive multiprocessor scheduling with rejection
The problem of online multiprocessor scheduling with rejection was introduced by Bartal, Leonardi, Marchetti-Spaccamela, Sgall and Stougie 4]. They show that for this problem the competitive ratio is 1 + 2:61803, where is the golden ratio. A modiied model of multipro-cessor scheduling with rejection is presented where preemption is allowed. For this model, it is shown that better performance is...
متن کاملOn-line Multiprocessor Tasks Scheduling with Rejection
This paper deals with multiprocessor task scheduling with ready times, due dates and prespecified processor allocation. In the studied problem tasks are not initially all available in the scheduler and can be executed only by given ready times, respecting their due dates. Moreover, a task can be examined in order to be processed only when it enters the scheduler. The concept of rejection is int...
متن کاملOnline Multiprocessor Scheduling
A scheduling problem is characterized by the properties of the jobs, the properties of the machines, the properties of the processing constraints and the optimality criterion. The properties of the jobs involve the processing time of the jobs, the release dates, deadlines and priorities. The properties of the machines are the number of machines, processing speeds of the machines and machine con...
متن کاملOnline scheduling with machine cost and rejection
In this paper we define and investigate a new scheduling model. In this new model the number of machines is not fixed; the algorithm has to purchase the used machines, moreover the jobs can be rejected. We show that the simple combinations of the algorithms used in the area of scheduling with rejections and the area of scheduling with machine cost are not constant competitive. We present a 2.61...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Acta Cybernetica
سال: 2009
ISSN: 0324-721X
DOI: 10.14232/actacyb.19.1.2009.8